Two Round Scheduling (TRS) Scheme for Linearly Extensible Multiprocessor Systems
نویسندگان
چکیده
منابع مشابه
Two Round Scheduling (TRS) Scheme for Linearly Extensible Multiprocessor Systems
Balancing the computational load over multiprocessor networks is an important problem in massively parallel systems. The key advantage of such systems is to allow concurrent execution of workload characterized by computation units known as processes or tasks. The scheduling problem is to maintain a balanced execution of all the tasks among the various available processors (nodes) in a multiproc...
متن کاملMinimum Distance Scheduling Scheme on Linearly Extensible Multiprocessor Network
In this millennium research is on to speed up more and more computation power by reducing the size of the system. In this direction, a novel Triangle based multiprocessor system has been proposed in this paper, which is compact in size (occupy lesser space) and exhibits all the features and characteristics of a commercial available multiprocessor. The proposed network has lesser number of proce...
متن کاملA ∆-Based Linearly Extensible Multiprocessor Network
To speeding up more and more computation power by reducing the size of the system, it is always a trend. In this direction, a novel Triangle based multiprocessor system has been proposed in this paper, which is compact in size (occupy lessor space) and exhibits all the features and characteristics of a commercial available multiprocessor. The proposed network has lessor number of processing ele...
متن کاملApplication of HBM on Linearly Extensible Triangle Multiprocessor Network
Hierarchical Balancing Method is applied on Linearly Extensible ∆ multiprocessor network. This method is used for calculating Load imbalance Factor for arbitrary binary and ternary trees. The result obtained are plotted and found that results are better as compared to HBM giving other results on some other multiprocessor network. Simulation studies show the better performance to other similar s...
متن کاملTwo-level Hierarchical Scheduling Algorithm for Real-time Multiprocessor Systems
The Earliest Deadline First (EDF) scheduling algorithm has the least runtime complexity among joblevel fixed-priority algorithms for scheduling tasks on multiprocessor architectures. However, EDF suffers from suboptimality in multiprocessor systems. This paper proposes a new restricted migration-based scheduling algorithm for multiprocessor real-time systems, called Two-level Hierarchical Sched...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Applications
سال: 2012
ISSN: 0975-8887
DOI: 10.5120/4646-6910